Fast Partial Subset Convolution for Steiner Tree Problem
نویسندگان
چکیده
We present a new algorithm that solves the minimum Steiner tree problem on an undirected graph with n nodes, k terminals, and m edges with bounded integer weights in time Õ((2− ε)n + nm). Our algorithm beats the aesthetically appealing and seemingly inherent 2 bound of the current best algorithm for Steiner tree problem from Björklund, Husfeldt, Kaski, and Koivisto. Our algorithm is based on fast subset convolution and a variant of the classical tree-separator theorem.
منابع مشابه
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives algorithms that, for a graph, given with a tree decomposition of width k, solve the dominated set problem in O(nk3) time and the problem to count the number of perfect matchings in O∗(2k) time. Using a generalisation of fast subs...
متن کاملNearly Optimal Partial Steiner Systems
A partial Steiner system Sp(t, k, n) is a collection of k-subsets (i.e. subsets of size k) of n element set such that every t-subset is contained in at most one k-subset. To avoid trivial cases, we assume 2 ≤ t < k < n. It is easy to see that the size of a partial Steiner system Sp(t, k, n) is at most ( n t )
متن کاملClifford Algebras Meet Tree Decompositions
We introduce the Non-commutative Subset Convolution – a convolution of functions useful when working with determinant-based algorithms. In order to compute it efficiently, we take advantage of Clifford algebras, a generalization of quaternions used mainly in the quantum field theory. We apply this tool to speed up algorithms counting subgraphs parameterized by the treewidth of a graph. We prese...
متن کاملClifford Algebras Meet Tree Decompositions∗
We introduce the Non-commutative Subset Convolution – a convolution of functions useful when working with determinant-based algorithms. In order to compute it efficiently, we take advantage of Clifford algebras, a generalization of quaternions used mainly in the quantum field theory. We apply this tool to speed up algorithms counting subgraphs parameterized by the treewidth of a graph. We prese...
متن کاملCliques in Steiner Systems
A partial Steiner (k, l)-system is a k-uniform hypergraph G with the property that every l-element subset of V is contained in at most one edge of G . In this paper we show that for given k, l and t there exists a partial Steiner (k, l)-system such that whenever an l-element subset from every edge is chosen, the resulting l-uniform hypergraph contains a clique of size t. As the main result of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013